منابع مشابه
Descent sets of cyclic permutations
We present a bijection between cyclic permutations of {1, 2, . . . , n+1} and permutations of {1, 2, . . . , n} that preserves the descent set of the first n entries and the set of weak excedances. This non-trivial bijection involves a Foata-like transformation on the cyclic notation of the permutation, followed by certain conjugations. We also give an alternate derivation of the consequent res...
متن کاملEnumerations of Permutations by Circular Descent Sets
The circular descent of a permutation σ is a set {σ(i) | σ(i) > σ(i + 1)}. In this paper, we focus on the enumerations of permutations by the circular descent set. Let cdesn(S) be the number of permutations of length n which have the circular descent set S. We derive the explicit formula for cdesn(S). We describe a class of generating binary trees Tk with weights. We find that the number of per...
متن کاملAnalyzing Random Permutations for Cyclic Coordinate Descent
We consider coordinate descent methods on convex quadratic problems, in which exact line searches are performed at each iteration. (This algorithm is identical to Gauss-Seidel on the equivalent symmetric positive definite linear system.) We describe a class of convex quadratic problems for which the random-permutations version of cyclic coordinate descent (RPCD) outperforms the standard cyclic ...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملDescent Patterns in Permutations
We consider the problem of finding generating functions for permutations which contain a given descent set. We expand on recent work of Remmel and Riehl, who developed a systematic way to find generating functions for permutations which contain a given finite descent set S, by showing that in many cases we can find generating functions for permutations σ in the symmetric group Sn whose descent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2011
ISSN: 0196-8858
DOI: 10.1016/j.aam.2011.02.006